منابع مشابه
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retrieving geographic data from a structured P2P network overlay. We have developed RDHTs as backend for the DART search engine, whose goal is to efficiently answer complex queries based on semantics and geographical conte...
متن کاملSuperquadrics for Segmenting and Modeling Range Data List of Tables
We present a novel approach to reliable and eecient recovery of part-descriptions in terms of superquadric models from range data. In contrast to common beliefs that the recovery of volumetric models is only possible after the data has been pre-segmented, usually in a hierarchical fashion using local surface properties, curvature etc., we show that a set of superquadric models can directly be r...
متن کاملRecord Range of Uniform Distribution
We consider a sequence of independent and identicaly distributed (iid) random variables with absolutely continuous distribution function F(x) and probability density function (pdf) f(x). Let Rnl be the largest observation after observing nth record and R(ns) be the smallest observation after observing the nth record. Then we say Wnr = Rnl− R(ns), n > 1, as the nth record range. We will c...
متن کاملA studentized range test for the equivalency of normal means under heteroscedasticity
A studentized range test using a two-stage and a one-stage sampling procedures, respectively, is proposed for testing the hypothesis that the average deviation of the normal means is falling into a practical indifference zone. Both the level and the power of the proposed test associated with the hypotheses are controllable and they are completely independent of the unknown variances. The two-st...
متن کاملA Practical, Robust Method for Generating Variable Range Tables
In optimized programs the location in which the current value of a single source variable may reside typically varies as the computation progresses. A debugger for optimized code needs to know all of the locations – both registers and memory addresses – in which a variable resides, and which locations are valid for which portions of the computation. Determining this information is known as the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1960
ISSN: 0003-4851
DOI: 10.1214/aoms/1177705684